Method and apparatus for sending and receiving channel state information in multiple-input multiple-output network wireless communication systems

ABSTRACT

A method and an apparatus for sending and receiving channel state information in network Multiple-Input Multiple-Output (MIMO) wireless communication systems are provided. Hybrid feedback technology is provided to transfer complete Channel State Information (CSI) to a transmitter by efficiently combining limited amounts of long-term channel information and short-term channel information are In a down link MIMO network system.

PRIORITY

This application is a Continuation Application of U.S. application Ser.No. 12/982,322, which was filed in the U.S. Patent and Trademark Officeon Dec. 30, 2010, and claims priority under 35 U.S.C. §119(a) to KoreanPatent Application No. 10-2009-0134817, which was filed in the KoreanIntellectual Property Office on Dec. 30, 2009, the contents of each ofwhich are incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to a method and an apparatus forsending and receiving channel state information in networkMultiple-Input Multiple-Output (MIMO) wireless communication systems,and more particularly, to a method and an apparatus for sending andreceiving channel state information that transmit channel information tobe divided into short-term channel information and long-term channelinformation and restoring full Channel State Information (CSI) in MIMOnetwork wireless communication systems.

2. Description of the Related Art

A MIMO system has been suggested to provide data service of high speedand high equality in wireless communication where a transmitter and areceiver of the MIMO system have a plurality of antennas. Spatialprocessing is required in a transmitter and a receiver in MIMOtechnology. Accordingly, the transmitter and the receiver should haveMIMO CSI between the transmitter and the receiver.

Specifically, the transmitter should have down link MIMO channelinformation from n_(T) transmission antennas of a Base TransceiverStation (BTS) to n_(R) reception antennas of an Access Terminal (AT) ina down link. Because a down link and an up link in a Frequency DivisionMultiplexing (FDM) system use different frequency domains, in order aBTS for having a down link CSI, a receiver should estimate a down linkchannel and feedback the estimated down link CSI to a transmitter. Tofeedback complete CSI to the transmitter, because transmission of muchreverse link information is required, a user can use only minimumfeedback information up to now.

As a result, to maximize system transmission capacity of a MIMO network,there is a need for research with respect to a feedback channel, atransceiver structure, and transmitting/receiving operations oftechnology transferring complete down link channel information to atransmitter using a limited amount of feedback information.

SUMMARY OF THE INVENTION

The present invention has been made in view of at least the aboveproblems, and provides a method and an apparatus for sending andreceiving channel state information that may transfer complete down linkCSI to a BTS by efficiently combining a limited amount of long-termfeedback information with a limited amount of short-term feedbackinformation in a MIMO network wireless communication systems.

In accordance with an aspect of the present invention, a method forsending channel state information of a terminal in a network MIMO systemhaving a plurality of base stations and the terminal, includesestimating a down link channel from a signal received from the basestation; extracting long-term channel information from the extracteddown link channel being in a state of a down link channel which does notinstantaneously change in every frame and transmitting the long-termchannel information through a long-term feedback channel divided andallocated into plural frames; and extracting short-term channelinformation from the extracted down link channel being in a state of adown link channel which instantaneously changes in every frame andtransmitting the short-term channel information through a short-termfeedback channel allocated every frame.

In accordance with another aspect of the present invention, a method forreceiving channel state information of a network in a network MIMOsystem having a plurality of base stations and the terminal, includesreceiving long-term channel information being in a state of a down linkchannel which does not instantaneously change in every frame through along-term feedback channel allocated through a plurality of frames byone of the plurality of base stations; receiving short-term channelinformation being in a state of a down link channel whichinstantaneously changes in every frame to which a short-term feedbackchannel is allocated by the one base station; and combining thelong-term channel information and the short-term channel information bythe one base station to restore a channel matrix indicating a down linkchannel between the base station and the terminal.

In accordance with another aspect of the present invention, an apparatusfor sending channel state information of a terminal in a network MIMOsystem having a plurality of base stations and the terminal, includes atransceiver performing data transmission and reception to and from thebase station; a channel estimator estimating a down link channel from asignal received from the base station; a long-term channel informationprocessor extracting long-term channel information from the extracteddown link channel being in a state of a down link channel which does notinstantaneously change in every frame and transmitting the long-termchannel information through a long-term feedback channel divided andallocated into plural frames using the transceiver; and a short-termchannel information processor extracting short-term channel informationfrom the extracted down link channel being in a state of a down linkchannel which instantaneously changes in every frame and transmittingthe short-term channel information through a short-term feedback channelallocated every frame using the transceiver.

In accordance with another aspect of the present invention, an apparatusfor receiving channel state information of a network in a network MIMOsystem having a plurality of base stations and the terminal, includes afeedback receiver of one of the plurality of base stations receiving andrestoring long-term channel information being in a state of a down linkchannel which does not instantaneously change in every frame through along-term feedback channel allocated through a plurality of frames, andreceiving and restoring short-term channel information being in a stateof a down link channel which instantaneously changes in every framethrough a short-term feedback channel allocated every frame; and achannel matrix restoring unit of the one base station combining thelong-term channel information and the short-term channel information torestore a channel matrix indicating a down link channel between the basestation and the terminal.

In the present invention as described above, a terminal may transmitlong-term channel information according to a long-term feedback channeltransmission period and short-term channel information according to ashort-term feedback channel transmission period to reduce a load andrestore complete CSI at the time of transmitting channel information.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other objects, features and advantages of the presentinvention will be more apparent from the following detailed descriptionin conjunction with the accompanying drawings, in which:

FIG. 1 is a diagram illustrating a MIMO network system according to anembodiment of the present invention;

FIG. 2 is a diagram illustrating a schematic configuration of anapparatus for transmitting channel state information of a terminalaccording to an embodiment of the present invention;

FIG. 3 is a flowchart illustrating a method for transmitting channelstate information of a terminal according to an embodiment of thepresent invention;

FIG. 4 is a flowchart illustrating a method for transmitting channelstate information of a terminal according to an embodiment of thepresent invention;

FIG. 5, FIG. 6A, and FIG. 6B are diagrams illustrating an apparatus forreceiving transmitter channel state information according to anembodiment of the present invention;

FIG. 7 is a flowchart illustrating a method for receiving channel stateinformation of a network according to an embodiment of the presentinvention;

FIG. 8 is a flowchart illustrating a method for receiving channel stateinformation of a network according to an embodiment of the presentinvention; and

FIG. 9 is a graph comparing transmission capacities of an SM systemaccording to full CSI feedback technology.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE PRESENT INVENTION

Embodiments of the present invention are described with reference to theaccompanying drawings in detail. The same reference numbers are usedthroughout the drawings to refer to the same or like parts. In addition,detailed descriptions of well-known functions and structuresincorporated herein may be omitted to avoid obscuring the subject matterof the present invention.

The present invention provides technology that may transfer completedown link CSI to a transmitter by efficiently combining a limited amountof long-term feedback information with a limited amount of short-termfeedback information in network MIMO wireless communication systems.

To feedback complete CSI according to an embodiment of the presentinvention, a down link MIMO channel matrix in each terminal is dividedinto a long-term eigen matrix which does not instantaneously change, ashort-term gain matrix which instantaneously changes, and an outputmatrix, and the divided matrixes are quantized. The quantized eigenmatrix is divided into plural frames, and the plural frames aretransmitted through a long-term feedback channel to be transmitted for along time, and the gain matrix and the output matrix are transmitted toa base station through a short-term feedback channel to be transmittedevery frame.

In an embodiment of the present invention, a long-term feedback channelis a transmission resource allocated through a plurality of frames, andthe present invention transmits long-term channel information to bedivided into plural frames of the long-term feedback channel. Thelong-term channel information is CSI that does not change for at leastone frame, which may become an eigen matrix.

Corresponding to the long-term feedback channel, in an embodiment of thepresent invention, a short-term feedback channel is a transmissionresource allocated for every frame, and the present invention transmitsshort-term channel information every frame of the short-term feedbackchannel. The short-term channel information is channel state informationthat changes with every frame, which can become a gain matrix and anoutput matrix.

The base station may combine long-term and short-term channelinformation transmitted to be divided into a long-term feedback channeland a short-channel feedback to restore a channel matrix between aterminal and the base station, and restore a down link MIMO channelmatrix between the terminal and plural base stations using the restoredchannel matrix and a channel state coefficient between base stations.

An embodiment of the present invention provides a code book for scalarquantization and vector quantization required for a channel matrixfeedback, and a vector code book to quantize an inter-cell channelcoefficient. Accordingly, an embodiment of the present inventionprovides a designed scalar code book by a non-uniform quantization inconsideration of distribution of gain values according to the number oftransmitting/receiving antennas and a channel environment for diagonalcomponent quantization of a gain matrix. Furthermore, the presentinvention provides a vector code book designed such that vectors of then_(R)×1 size have isotropic distribution in an n_(R)-dimensional complexvector space for a column vector quantization of an output matrix. Thepresent invention provides a vector code book designed such that vectorsof the size M×1 have isotropic distribution in an M-dimensional complexvector space for quantization of an inter-cell channel coefficient.

FIG. 1 is a diagram illustrating a MIMO network system according to anembodiment of the present invention.

Referring to FIG. 1, an embodiment of the present invention considers aCollaborative Base Transceiver Station (referred to as “C-BTS”hereinafter) 500 and a collaborative Access Terminal (referred to as“AT” hereinafter) 100 in a forward link system in which the AT 100 isdistributed in a cluster composed of M BTSs. In the embodiment of thepresent invention, it is assumed that each C-BTS 500 uses n_(T)transmission antennas, and all the ATs 100 use n_(R) reception antennas.

An M value being the number of C-BTSs 500 capable of operating acollaboration method may instantaneously change due to a instantaneouschannel variation between respective ATs 100 and C-BTSs 500. Theforegoing embodiment considers a cluster composed of three C-BTSs 500(M=3) for explanation. However, the present invention can extend to acluster including an optional number of C-BTSs 500.

It is assumed that x is an Mn_(T)×1 data symbol vector simultaneouslytransmitted to a maximum of Mn_(T) ATs 100 through a total of Mn_(T)transmission antennas of M-BTSs 500, and y is a n_(R)×1 received vectorof the AT 100. Here, assuming a frequency non-selective fading, areceived signal can be expressed by a following Equation (1).:y=[√{square root over (γ₁)}H ₁√{square root over (γ₂)}H ₂√{square rootover (γ₃)}H ₃ ]Fx+n  (1)

where, γ_(m) is an average Signal-to-Noise Ratio (SNR) from an m-thC-BTS 500 to an AT 100, and H_(m) is an n_(R)×n_(T) complex matrix fromthe m-th C-BTS 500 to the AT 100. The H_(network) is n_(R)×Mn_(T)collaborative channel matrix from M C-BTSs 500 to the AT100, which isH_(network)=[√{square root over (γ₁)}H₁ √{square root over (γ₂)}H₂√{square root over (γ₃)}H₃], and the n_(k) is an n_(R)×1 Additive WhiteGaussian Noise (AWGN) vector. Further, F is an Mn_(T)×Mn_(T)transmission pre-coding for joint pre-coding of the x.

The AT 100 estimates down link channel {H_(m)}_(m=1, . . . , 3) fromneighboring C-BTSs 500, and quantizes it to {{tilde over(H)}_(m)}_(m=1, . . . , 3) by hybrid feedback technology according tothe present invention and feedbacks the quantized {{tilde over(H)}_(m)}_(m=1, . . . , 3) to respective C-BTSs 500. Moreover, the AT100 estimates an inter-cell channel coefficient between cellscompensating for a channel difference between the C-BTSs 500, quantizesit to {X_(m)}_(m=1, . . . , 3), and feedbacks the quantized{X_(m)}_(m=1, . . . , 3) to the respective C-BTSs 500.

The C-BTSs 500 connect with a MIMO network pre-coder (referred to as‘pre-coder’ hereinafter) through high speed wideband wired communicationnetwork, and transfer the feedback quantized complete CSIs from the AT100 to the pre-coder 600 through a wired communication network.

The pre-coder 600 calculates various MIMO technique combinations for theATs 100 included in a corresponding cluster using feedback channelinformation {tilde over (H)}_(network)=[χ₁{tilde over (H)}₁ χ₂{tildeover (H)}₂ χ₃{tilde over (H)}₃], and a received SINR of ATs 100according to a pre-coding matrix by the combinations. Based on thecalculation, the pre-coder 600 determines AT 100 set transmittingoptimized data, a MIMO technology combination to be used bycorresponding ATs 100, and a pre-coding matrix. The pre-coder 600informs a scheduler of a corresponding C-BTS 500 of weight informationto be used by ATs 100 transmitting data selected by scheduling and acorresponding AT 100, and Modulation and Coding Scheme (MCS) informationof data to be transmitted, and a scheduler of each C-BTS 500 transmitsdata to a corresponding AT 100 by referring information provided fromthe pre-coder 500.

The AT 100 estimates an intra-cell down link channel H_(m) from theC-BTS 500, and feedbacks quantized complete CSI {tilde over (H)}_(m) torespective C-BTS 500 using a limited amount of reverse link feedbackinformation. There is a need for a large amount of instantaneousshort-term reverse link feedback information to feedback aninstantaneously changed intra-cell down link channel H_(m) itself to atransmitter. Such information is information related to a channel state.Hereinafter, channel state information transmitted from the AT 100 tothe C-BTS 500 with a short-term period is referred to as “short-termchannel information”.

Since a plurality of links divide a limited reverse link band width intoa feedback channel and a data channel to be used, increase of short-termchannel information transmitted every reverse link transmission frame isdirectly connected to reduction of a reverse link data channel capacityand a forward link data channel capacity according to reduction of afeedback channel capacity. Because reverse link feedback informationtransmitted with long-term for a long time through much reverse linktransmission frames has small transmission feedback capacity by reverselink transmission frames, it influences reverse and forward data channelcapacities a little. However, long-term channel information is notsuitable to transmit instantaneously changed channel information.Hereinafter, channel state information transmitted from the AT 100 tothe C-BTS 500 with a long-term period is referred to as ‘long-termchannel information’.

Accordingly, down link channel information may be divided into long-termchannel information not changed for a long time and short-term channelinformation instantaneously changed, and the long-term channelinformation and the short-term channel information are divided andtransmitted through a long-term feedback channel transmitted for a longtime through many frames and a short-term feedback channel transmittedevery frame.

Hybrid feedback technology according to the present invention dividesand expresses an intra-cell down link channel matrix H_(m) into an eigenmatrix E_(m), a gain matrix D_(m), and an output matrix W_(m). In theembodiment of the present invention, the eigen matrix E_(m) becomeslong-term channel information, the gain matrix D_(m) and the outputmatrix W_(m) become short-term channel information. The divided matrixescan expressed by a following Equation (2).:H _(m) =W _(m) D _(m) E _(m) ^(H)  (2)

After divided as illustrated in the Equation (2), the eigen matrixE_(m), the gain matrix D_(m), and the output matrix W_(m) are quantized,and the quantized eigen matrix E_(m) is transmitted through a long-termfeedback channel, and the quantized gain matrix D_(m), and the quantizedoutput matrix W_(m) are transmitted through a short-term feedbackchannel.

In the Equation (2), because an unitary matrix E_(m) of the sizen_(T)×n_(T) is an eigen matrix of E[H_(m)H_(m)], and obtained byaccumulating and averaging covariance H_(m) ^(H) H_(m) of an intra-celldown link channel matrix H_(m) for an enough long time, it does notchange for a long time. Here, the enough long time may be one period ofat least long-term feedback channel.

The gain matrix D_(m) is a diagonal matrix of the size n_(R)×n_(T), anddiagonal components are composed of R (R≦min(n_(R),n_(T))) values andmin(n_(R),n_(T))-R zeros, with the size greater than or equal to aconstant reference value R_(th). Diagonal components constituting thegain matrix D_(m) indicate an instantaneous gain value received whenbeam forming is achieved by n_(T) column vectors of an eigen matrixE_(m). Consequently, according to an instantaneous channel situation,the number R of gain values greater than or equal to a reference valueand values instantaneously change. Specifically, when a transmissionspace correlation is high, the number R of gain values equal to aconstant reference value R_(th) tends to become smaller, and respectivegains tend to be increased.

The output matrix W_(m) of the size n_(R)×n_(R) is composed of vectorsof the size n_(R)×1 having R unit norm characteristics corresponding toR gain values of a D_(m) matrix and n_(R)-R zero vectors of the sizen_(R)×1. R column vectors constituting the output matrix W_(m) meanreceiving weight vectors to obtain R gain values. Accordingly, R columnvectors instantaneously change according to an instantaneous channelsituation.

For example, when n_(T) is 4 and n_(R) is 2, an intra-cell down linkchannel matrix H_(m) can be expressed by the following Equation (3) tobe divided into an eigen matrix E_(m), a gain matrix D_(m), and anoutput W_(m).

$\begin{matrix}{{:H_{m}} = {{W_{m}D_{m}E_{m}^{H}} = {{\left\lbrack {w_{m,1}\mspace{14mu} w_{m,2}} \right\rbrack\begin{bmatrix}d_{m,1} & 0 & 0 & 0 \\0 & d_{m,2} & 0 & 0\end{bmatrix}}{\quad\left\lbrack \begin{matrix}e_{m,1} & e_{m,2} & e_{m\; 3} & \left. e_{m\; 4} \right\rbrack^{H}\end{matrix} \right.}}}} & (3)\end{matrix}$

where, {e_(m,n)}_(n=1,2,3,4) are four column vectors constituting theeigen matrix E_(m), and a norm of {W_(m,n)}_(n=1,2) constituting W_(m)is 1. That is, ∥w_(m,1)∥=∥w_(m,2)∥=1. Further, it is assumed that all ofdiagonal components {d_(m,n)}_(n=1,2) constituting the gain matrix D_(m)have the size equal to or greater than a constant reference valueR_(th).

Each AT 100 expresses an intra-cell down link channel matrix H_(m) bythe Equation (2) to be divided into the eigen matrix E_(m), the gainmatrix D_(m), and the output matrix W_(m), and quantizes the dividedmatrixes.

The AT 100 quantizes and transmits the eigen matrix E_(m) through along-term feedback channel. Furthermore, the AT 100 scalar-quantizes andtransmits R diagonal components {d_(m,n)}_(n=1, . . . , R) of the gainmatrix D_(m) through a short-term feedback channel. In addition, the AT100 vector-quantizes and transmits R n_(R)×1 column vectors constitutingthe output matrix W_(m) through a short-term feedback channel.

The gain matrix D_(m) and the output matrix W_(m) can be transmitted tobe divided. However, without division of the gain matrix and the outputmatrix, after one matrix may be quantized, the quantized matrix can betransmitted through a short-term feedback channel. As a result,short-term channel information really required in hybrid feedbacktechnology according to an embodiment of the present invention isinformation regarding R quantized scalar values and R quantized n_(R)×1vector values.

FIG. 2 is a diagram illustrating a schematic configuration of anapparatus for transmitting channel state information of a terminalaccording to an embodiment of the present invention.

Referring to FIG. 2, an AT 100 includes a transceiver 110, a channelestimator 120, a long-term channel information processor 130, ashort-term channel information processor 140, and a channel coefficientprocessor 150. Here, a terminal uses a MIMO antenna and the n_(R) MIMOantenna can be used to be indicated as reference numerals 21-1 to 21-n_(R) in FIG. 2.

The transceiver 110 includes a demodulator, and receives and outputspilot channels received from neighboring C-BTSs.

The channel estimator 120 estimates pilot channels received fromneighboring C-BTSs to estimate down link channels{H_(m)}_(m=1, . . . , M) from M C-BTSs 500 to a corresponding AT 100.Moreover, the channel estimator 120 estimates down link MIMO networkchannel H_(network)=[√{square root over (γ₁)}H₁ √{square root over(γ₂)}H₂ √{square root over (γ₃)}H₃] from M C-BTSs 500 to a correspondingAT 100.

The long-term channel information processor 130 calculates and quantizesan eigen matrix E_(m) of a corresponding down link channel H_(m) usingdown link channel information H_(m) from a m-th C-BTS 500 to an AT 100estimated by the channel estimator 120. The long-term channelinformation processor 130 feedbacks the quantized eigen matrix {tildeover (E)}_(m) to an m-th C-BTS as Long-Term Eigen Matrix (LTEM) feedbackinformation LTEM_(m) through a long-term feedback channel. The long-termchannel information processor 130 performs such a procedure for MC-BTSs. Here, the eigen matrix E_(m) of the size n_(T)×n_(T) can becalculated by averaging covariance H_(m) ^(H)H_(m) of H_(m) for anenough time to obtain a covariance matrix E[H_(m) ^(H)H_(m)], andperforming Eigen Value Decomposition (EVD) for the covariance matrixE[H_(m) ^(H)H_(m)]. The larger a corresponding eigen value is, n_(T)Column vectors, namely, eigen vectors constituting E_(m), are arrangedat a left side. Accordingly, when E_(m)=[e_(m,1) e_(m,2) . . . e_(m,n)_(T) ], a maximum eigen vector becomes e_(m, 1).

The short-term channel information processor 140 multiplies Hermitain ofan eigen matrix {tilde over (E)}_(m) obtained by the long-term channelinformation processor 130 by the down link channel H_(m) as illustratedin a following Equation (4).:H _(m) {tilde over (E)} _(m) ^(H) =F _(m) =[f _(m,1) f _(m,1) . . . f_(m,n) _(T) ]  (4)

where, n_(R)×n_(T) matrixes F_(m) are composed of n_(T) column vectors{f_(m,n)}_(n=1, . . . , n) _(T) having the size n_(R)×1. The short-termchannel information processor 140 performs the foregoing procedure for MC-BTSs.

The short-term channel information processor 140 may quantize andfeedback the obtained F_(m) to an m-th C-BTS 500 as short-term channelinformation through a short-term feedback channel.

As illustrated previously, F_(m) can be divided into two componentsincluding a gain matrix D_(m) and an output matrix W_(m). The short-termchannel information processor 140 may divide the F_(m) into a gainmatrix D_(m) and an output matrix W_(m), scalar and vector-quantize thegain matrix D_(m) and the output matrix W_(m), and feedback thequantized gain matrix D_(m) and output matrix W_(m) to the m-th C-BTS asshort-term channel information through a short-term feedback channel.

As illustrated earlier, the following is an operation of the short-termchannel information processor 140 separately transmitting the matrixes.The short-term channel information processor 140 obtains a norm of n_(T)column vectors of a matrix F_(m), namely, {∥f_(m,n)∥}_(n=1, . . . , n)_(T) , and compares {∥f_(m,n)∥}_(n=1, . . . , R) with a reference valueR_(th). The short-term channel information processor 140scalar-quantizes R values {∥f_(m,n)∥}_(n=1, . . . , R) greater than theR_(th). Subsequently, the short-term channel information processor 140feedback indexes of R quantized scalar values to the m-th C-BTS 500through a short-term feedback channel as R Short-term Gain Index (SGI)feedback information {SGI_(m,n)}_(n=1, . . . , R). Here scalarquantization designs a scalar code book F_(scalar) composed of pluralscalar values, and selects a scalar value minimizing a difference with{∥f_(m,n)∥}_(n=1, . . . , R) as illustrated in the following Equation(5).

$\begin{matrix}{{{:{\overset{\sim}{d}}_{m,n}} = {\underset{d \in F_{scalar}}{argmin}\left( {d - {f_{m,n}}} \right)}^{2}},{n = 1},\ldots\mspace{14mu},R} & (5)\end{matrix}$

The scalar code book F_(scalar) is preferably designed by non-uniformquantization in consideration of distribution of{∥f_(m,n)∥}_(n=1, . . . , R) according to the number oftransmission/reception antennas and a channel environment. A quantizedscalar value indicated by a feedback {SGI_(m,n)}_(n=1, . . . , R) is Rdiagonal components constituting a gain matrix D_(m) of the Equation(2). The short-term channel information processor 24 performs the scalarquantization for M C-BTSs 500.

The short-term information processor 140 normalizes R column vectors{∥f_(m,n)∥}_(n=1, . . . , R) of a matrix F_(m) as illustrated in afollowing Equation (6). Next, the short-term channel informationprocessor 140 vector-quantizes and feedbacks R normalized vectors{∥{circumflex over (f)}_(m,n)∥}_(n=1, . . . , R) to the m-th C-BTSthrough a short-term feedback channel as R Output Vector Index (OVI)feedback {OVI_(m,n)}_(n=1, . . . , R).

$\begin{matrix}{{{:{\hat{f}}_{m,n}} = \frac{f_{m,n}}{f_{m,n}}},{n = 1},\ldots\mspace{14mu},R} & (6)\end{matrix}$

The quantized vector value indicated by a feedback{OVI_(m,n)}_(n=1, . . . , R) indicates R column vector constituting anoutput matrix W_(m) of the Equation (2). The short-term channelinformation processor 140 performs the vector quantization for M C-BTSs500. The vector quantization designs a vector code book F_(intra)composed of vectors having the size n_(R)×1, and selects a vectorminimizing a distance D(w, {circumflex over (f)}_(m,n)} from{∥{circumflex over (f)}_(m,n)∥}_(n=1, . . . , R), namely, exactlyimitating {∥{circumflex over (f)}_(m,n)∥}_(n−1, . . . , R) the most fromthe vector code book F_(intra),

$\begin{matrix}{{{:{\overset{\sim}{w}}_{m,n}} = {\arg{\min\limits_{w \in F_{intra}}{D\left( {w,{\hat{f}}_{m,n}} \right)}}}},{n = 1},\ldots\mspace{14mu},R} & (7)\end{matrix}$

Vectors of the size n_(R)×1 constituting the vector code book F_(intra)should be designed to have isotropic distribution in ann_(R)-dimensional complex vector space. Accordingly, the vectors of thesize n_(R)×1 may use a code book designed by a Random VectorQuantization (RVQ) scheme and a Grassmannian code book adapted toIEEE802.16e.

The channel coefficient processor 150 constructs a quantized intra-cellchannel matrix {{tilde over (H)}_(m)}_(m=1, . . . , M) expressed by afollowing Equation (8). That is, the quantized intra-cell channel matrix{{tilde over (H)}_(m)}_(m=1, . . . , M) can be obtained by combining allvalues quantized by the long-term channel information processor 130 andthe short-term channel information processor 140. The values areobtained by quantizing the eigen matrix E_(m), the gain matrix D_(m),and the output matrix W_(m) that are structural components of a channel.

Subsequently, the channel coefficient processor 150 estimates aninter-cell channel coefficient compensating for a channel differencebetween C-BTSs 500 to exactly imitate the estimated down link MIMOnetwork channel H_(network)=[√{square root over (γ₁)}H₁ √{square rootover (γ₂)}H₂ √{square root over (γ₃)}H₃] the most, and quantizes it toobtain and transmit {χ_(m)}_(m=1, . . . , 3) to a C-BTS 500 through theshort-term feedback channel in an Inter-Cell Vector Index (ICVI)feedback way.{tilde over (H)} _(m) ={tilde over (W)} _(m) {tilde over (D)} _(m){tilde over (E)} _(m) ^(H) =[{tilde over (w)} _(m,1) . . . {tilde over(w)} _(m,R)0 . . . 0]diag{{tilde over (d)} _(m,1) , . . . ,{tilde over(d)} _(m,R),0, . . . ,0}{tilde over (E)} _(m) ^(H)  (8)

Namely, the channel coefficient processor 150 constructs a quantizedintra-cell channel matrix {{tilde over (H)}_(m)}_(m=1, . . . , M) bycombining the {tilde over (E)}_(m), the {tilde over (D)}_(m), and the{tilde over (W)}_(m) previously obtained as illustrated in the Equation(8). Next, the channel coefficient processor 150 vector-quantizes avector c=[X₁ . . . X_(M)]^(T) composed of an inter-cell channelcoefficient minimizing a distance between a MIMO network channel {tildeover (H)}_(network)=[χ₁{tilde over (H)}₁ χ₂{tilde over (H)}₂ χ₃{tildeover (H)}₃] composed of a quantized intra-cell channel matrix {{tildeover (H)}_(m)}_(m−1, . . . , M) and a real down link MIMO networkchannel H_(network)=[√{square root over (γ₁)}H₁ √{square root over(γ₂)}H₂ √{square root over (γ₃)}H₃] estimated by the channel estimator120. The vector quantization designs an inter-cell channel vector codebook F_(inter) composed of vectors having the size M×1, and selects avector minimizing a distance D({tilde over (H)}_(network), H_(network))between H_(network) and {tilde over (H)}_(network) as illustrated in afollowing Equation (9) from the designed inter-cell channel vector codebook F_(inter).

$\begin{matrix}{{:c} = {\arg{\min\limits_{c \in F_{inter}}{D\left( {{\overset{\sim}{H}}_{network},H_{network}} \right)}}}} & (9)\end{matrix}$

Assuming that average SNR {γ_(m)}_(m=1, . . . , M) from different C-BTSs500 to one AT 100 in a cluster performing cooperation communication aresimilar thereto, vectors having the size M×1 constituting the inter-cellchannel vector code book F_(inter) should be designed to have isotropicdistribution in an M-dimensional complex vector space. Accordingly, thevectors having the size M×1 may use a code book designed in an existingRVQ scheme or a Grassmannian adapted to IEEE802.16e.

FIG. 3 is a flowchart illustrating a method for transmitting channelstate information of a terminal according to an embodiment of thepresent invention.

First, the AT 100 estimates a pilot channel received from neighboringC-BTSs 500 to estimate down link channels {H_(m)}_(m=1, . . . , M) fromM C-BTSs 500 to a corresponding AT 100, respectively in Step 310.Further, the AT 100 estimates a down link MIMO network channelH_(network)=[√{square root over (γ₁)}H₁ √{square root over (γ₂)}H₂√{square root over (γ₃)}H₃] from C-BTSs 500 to the AT 100. Subsequently,the AT 100 calculates an eigen matrix E_(m) of a corresponding down linkchannel H_(m) using down link channel information H_(m) from an m-thC-BTS 500 to the AT 100 among the estimated channels, and quantizes theeigen matrix E_(m) to obtain a quantized matrix {tilde over (E)}_(m) inStep 320. Subsequently, the AT 100 feedbacks LTEM feedback informationLTEM_(m) to the m-th C-BTS 500 through the long-term feedback channel inStep 325. The AT 100 may perform Step 320 and Step 325 for M C-BTSs 500,respectively. Here, the eigen matrix E_(m) of the size n_(T)×n_(T) isobtained by eigen value decomposing (EVD) a long-term covariance matrixE[H_(m) ^(H)H_(m)] obtained by averaging covariance H_(m) ^(H)H_(m) foran enough long time. the larger a corresponding eigen value is, n_(T)column vectors, namely, eigen vectors constituting E_(m), are arrangedat a left side. Accordingly, when E_(m)=[e_(m,1) e_(m,2) . . . e_(m,n)_(T) ], a maximum eigen vector becomes e_(m, 1).

Next, the AT 100 multiplies down link channel information H_(m) from anm-th C-BTS estimated in previous Step 310 to the AT 100 by Hermitain ofan eigen matrix {tilde over (E)}_(m), estimated and quantized at Step320 as illustrated in the Equation (4) to calculate and quantize a gainweight matrix F_(m) in Step 330. The n_(R)×n_(T) matrix F_(m) iscomposed of n_(T) column vectors {f_(m,n)}_(n=1, . . . , n) _(T) havingthe size n_(R)×1.

As illustrated earlier, after quantizing the F_(m), the AT 100 canfeedback it to the m-th C-BTS through a short-term feedback channel asshort-term channel information in Step 335. Further, the AT 100 mayperform Steps 330 and 335 for M C-BTSs.

The AT 100 estimates and quantizes an inter-cell channel coefficient inStep 340. The AT 100 constructs an inter-cell channel matrix {{tildeover (H)}_(m)}_(m=1, . . . , M) expressed by the Equation (8), andestimates an inter-cell channel coefficient compensating a channeldifference between C-BTSs 500 to exactly imitate the estimated down linkMIMO network channel H_(network)=[√{square root over (γ₁)}H₁ √{squareroot over (γ₂)}H₂ √{square root over (γ₃)}H₃] at Step 310 the most, andquantizes it to obtain {X_(m)}_(m=1, . . . , 3).

The quantized channel matrix {{tilde over (H)}_(m)}_(m=1, . . . , M) canbe obtained by a combination of a quantized value of E_(m) and aquantized value of F_(m). The inter-cell channel coefficient{X_(m)}_(m=1, . . . , 3) is a value minimizing a distance between a MIMOnetwork {tilde over (H)}_(network)=[χ₁{tilde over (H)}₁ χ₂{tilde over(H)}₂ χ₃{tilde over (H)}₃] composed of the quantized channel matrix{{tilde over (H)}_(m)}_(m=1, . . . , M) and a real down link MIMOnetwork channel H_(network)=[√{square root over (γ₁)}H₁ √{square rootover (γ₂)}H₂ √{square root over (γ₃)}H₃] estimated at Step 310. The AT100 vector-quantizes vectors c=[X₁ . . . X_(M)]^(T) composed of theinter-cell channel coefficient {X_(m)}_(m=1, . . . , 3).

The vector quantization is performed at Step 340 by designing theinter-cell channel vector code book F_(inter) composed of vectors havingthe size M×1, and selecting a vector minimizing a distance D({tilde over(H)}_(network),H_(network)) between H_(network) and {tilde over(H)}_(network) from the inter-cell channel vector code book F_(inter) asillustrated in the Equation (9).

Assuming that averages SNR {γ_(m)}_(m=1, . . . , M) from C-BTSs 500performing cooperation communication to one AT 100 are similar to eachother, vectors of the size M×1 constituting the inter-cell channelvector code book F_(inter) should be designed to have isotropicdistribution in an M-dimensional complex vector space. Accordingly,vectors of the size M×1 may use a code book designed in an existing RVQscheme and a Grassmannian code book adapted to IEEE802.16e.

Subsequently, the AT 100 transmits values vector-quantized vectors c=[X₁. . . X_(M)]^(T) composed of inter-cell channel coefficient{X_(m)}_(m=1, . . . , 3) to a C-BTS 500 through a short-term feedbackchannel in an inter-cell vector index (ICVI) in Step 345.

FIG. 4 is a flowchart illustrating a method for transmitting channelstate information of a terminal according to an embodiment of thepresent invention.

First, the AT 100 estimates a pilot channel received from neighboringC-BTSs 500 to estimate down link channels {H_(m)}_(m=1, . . . , M) fromM C-BTSs 500 to a corresponding AT 100 in Step 410. Further, the AT 100estimates down link MIMO network channel H_(network)=[√{square root over(γ₁)}H₁ √{square root over (γ₂)}H₂ √{square root over (γ₃)}H₃] from MC-BTSs 500 to a corresponding AT 100.

Subsequently, the AT 100 calculates an eigen matrix E_(m) of acorresponding down link channel using down link channel informationH_(m) from an m-th C-BTS 500 to the AT 100 among the estimated channels,and quantizes it to obtain a matrix {tilde over (E)}_(m) in Step 420.Next, the AT 100 feedbacks LTEM feedback information LTEM_(m) to them-th C-BTS 500 through a long-term channel in Step 425.

The AT 100 may perform Steps 420 and 425 for M C-BTSs 500. Here, theeigen matrix E_(m) of the size n_(T)×n_(T) is obtained by eigen valuedecomposing (EVD) a long-term covariance matrix E[H_(m) ^(H)H_(m)]obtained by averaging covariance H_(m) ^(H)H_(m) for an enough longtime. the larger a corresponding eigen value is, n_(T) column vectors,namely, eigen vectors constituting E_(m), are arranged at a left side.Accordingly, when E_(m)=[e_(m,1) e_(m,2) . . . e_(m,n) _(T) ], a maximumeigen vector becomes e_(m, 1).

Next, the AT 100 multiplies down link channel information H_(m) from anm-th C-BTS 500 to the AT 100 estimated at Step 410 by Hermitain of aneigen {tilde over (E)}_(m) estimated and quantized at Step 420 tocalculate and quantize a gain weight matrix F_(m) in Step 430.

An n_(R)×n_(T) matrix F_(m) is composed of n_(T) column vectors{f_(m,n)}_(n=1, . . . , n) _(T) of the size n_(R)×1.

Subsequently, the AT 100 calculates and quantizes a gain matrix D_(m)from the gain weight matrix F_(m) in Step 440. That is, the AT 100calculates a norm of n_(T) column vectors of the gain weight matrixF_(m) obtained at Step 430, namely, {∥f_(m,n)∥}_(n−1, . . . , n) _(T) .This means a gain matrix D_(m). Further, the AT 100 compares{∥f_(m,n)∥}_(n=1, . . . , n) _(T) with a reference value R_(th). The AT100 scalar-quantizes R values, namely, {∥f_(m,n)∥}_(n=1, . . . , R)greater than R_(th).

Subsequently, the AT 100 transmits the quantized gain matrix to ashort-term feedback channel in Step 445. That is, the AT 100 feedbacksan index of R quantized scalar values to an m-th C-BTSs 500 through ashort-term feedback channel as R SGI feedback information{SGI_(m,n)}_(n=1, . . . , R). The scalar quantization is performed atStep 440 by designing a scalar code book F_(scalar) composed of pluralscalar values, and selecting a scalar value minimizing a distancebetween {∥f_(m,n)∥}_(n=1, . . . , R) as illustrated in the Equation (5)from the F_(scalar).

The scalar code book F_(scalar) is designed by non-uniform quantizationin consideration of distribution of {∥f_(m,n)∥}_(n=1, . . . , R)according to the number of transmission and reception antennas and achannel environment.

A quantized scalar value indicated by a feedback{SGI_(m,n)}_(n=1, . . . , R) is R diagonal components constituting again matrix D_(m) of the Equation (2). The AT 100 may perform Steps 440and 445 for M C-BTSs 500.

Next, the AT 100 calculates and quantizes an output matrix W_(m) from again weight matrix F_(m) in Step 450. Namely, the AT 100 normalizes Rcolumn vectors {∥f_(m,n)∥}_(n=1, . . . , R) of the matrix F_(m) obtainat Step 430 as illustrated in the Equation (6) to calculate an outputmatrix W_(m). Subsequently, that is, the AT 100 vector-quantizes Rnormalized vectors {∥{circumflex over (f)}_(m,n)∥}_(n=1, . . . , R).Next, the AT 100 feedbacks R Output Vector Index (OVI) feedbackinformation {OVI_(m,n)}_(n=1, . . . , R) to an m-th C-BTSs 500 through ashort-term feedback channel in Step 455.

A quantized vector value indicated by a feedback{OVI_(m,n)}_(n=1, . . . , R) represents R column vectors constituting anoutput matrix W_(m) of the Equation (2). The AT 100 may perform Steps450 and 455 for M C-BTSs 500. The vector quantization is performed atStep 450 by designing the vector code book F_(inter) composed of vectorshaving the size n_(R)×1, and selecting a vector {∥ƒ{circumflex over(f)}_(m,n)∥}_(n=1, . . . , R) minimizing a distance D(w, {circumflexover (f)}_(m,n)} between {∥{circumflex over(f)}_(m,n)∥}_(n=1, . . . , R), namely, exactly imitating {∥{circumflexover (f)}_(m,n)∥}_(n=1, . . . , R) from F_(inter) as illustrated in theEquation (7).

Vectors of the size n_(R)×1 constituting a vector code book F_(intra)should be designed to have isotropic distribution in ann_(R)-dimensional complex vector space. Accordingly, the vectors of thesize n_(R)×1 may use a code book designed by an existing Random VectorQuantization (RVQ) scheme or a code book Grassmannian adapted toIEEE802.16e.

The AT 100 estimates and quantizes an inter-cell channel coefficient inStep 460. At Step 460, the AT 100 constructs a channel matrix {{tildeover (H)}_(m)}_(m=1, . . . , M), and estimates an inter-cell channelcoefficient compensating for a channel difference between C-BTSs 500 toexactly imitate the estimated down link MIMO network channelH_(network)=[√{square root over (γ₁)}H₁ √{square root over (γ₂)}H₂√{square root over (γ₃)}H₃] at Step 410 the most, and quantizes it toobtain {X_(m)}_(m=1, . . . , 3).

The quantized channel matrix {{tilde over (H)}_(m)}_(m=1, . . . , M) canbe constructed by combining {tilde over (E)}_(m) obtained at Step 430,{tilde over (D)}_(m) obtained at Step 440, and {tilde over (W)}_(m)obtained at Step 450 as illustrated in the Equation (8).

The inter-cell channel coefficient {X_(m)}_(m=1, . . . , 3) is a valueminimizing a distance between a MIMO network channel {tilde over(H)}_(network)=[χ₁{tilde over (H)}₁ χ₂{tilde over (H)}₂ χ₃{tilde over(H)}₃] composed of the quantized channel matrix {{tilde over(H)}_(m)}_(m=1, . . . , M) and a real down link MIMO network channelH_(network)=[√{square root over (γ₁)}H₁ √{square root over (γ₂)}H₂√{square root over (γ₃)}H₃] estimated at Step 410. The AT 100vector-quantizes a vector c=[X₁ . . . X_(M)]^(T) composed of theinter-cell channel coefficient {X_(m)}_(m=1, . . . , 3).

The vector quantization is performed at Step 460 by designing theinter-cell vector code book F_(inter) composed of vectors having thesize M×1, and selecting a vector minimizing a distance D({tilde over(H)}_(network),H_(network)) between H_(network) and {tilde over(H)}_(network) from the inter-cell channel vector code book F_(inter) asillustrated in the Equation (9).

Assuming that averages SNR {γ_(m)}_(m=1, . . . , M) from C-BTSs 500performing cooperation communication to one AT 100 are similar to eachother, vectors of the size M×1 constituting the inter-cell channelvector code book F_(inter) should be designed to have isotropicdistribution in an M-dimensional complex vector space. Accordingly,vectors of the size M×1 may use a code book designed in an existing RVQscheme and a Grassmannian code book adapted to IEEE802.16e.

Subsequently, the AT 100 transmits values vector-quantized vectors c=[X₁. . . X_(M)]^(T) composed of inter-cell channel coefficient{X_(m)}_(m=1, . . . , 3) to a C-BTS 500 through a short-term feedbackchannel in an Inter-Cell Vector Index (ICVI) in Step 465.

FIG. 5, FIG. 6A, and FIG. 6B are diagrams illustrating an apparatus forreceiving transmitter channel state information according to anembodiment of the present invention.

Referring to FIG. 5, FIG. 6A, and FIG. 6B, a control channel informationreceiver of a MIMO network system of the present invention includes aplurality of C-BTSs 500 and a MIMO network pre-coder (referred to as‘pre-coder’) 600.

The C-BTSs 500 include a plurality of antennas 41-1 to 41-n _(R), 42-1to 42-n _(R) for MIMO type transmission/reception. Each C-BTS 500includes a feedback receiver 510 and a channel matrix restoring unit520. Further, the feedback receiver 510 includes an output matrixrestoring unit 511, a gain matrix restoring unit 513, and an eigenmatrix restoring unit 515. In another embodiment of the presentinvention, a feedback receiver 510 includes a gain weight matrixrestoring unit 517 instead of the output matrix restoring unit 511 andthe gain matrix restoring unit 513.

The pre-coder 600 includes an inter-cell channel coefficient restoringunit 610, a network channel matrix restoring unit 620, and a schedulingand pre-coder determinator 630.

When the AT 100 transmits channel state information as illustrated inFIG. 4, the feedback receiver 510 includes an output matrix restoringunit 511, a gain matrix restoring unit 513, and an eigen matrixrestoring unit 515 as shown in FIG. 6 a, which is operated as follows.The feedback receiver 510 of each C-BTS 500 decodes received{OVI_(m,n)}_(n=1, . . . , R), and restores an output matrix {tilde over(W)}_(m) as illustrate in a following Equation (10) using vectorsindicated in F_(intra) by R vector indexes. This is achieved by anoutput matrix restoring unit 511.:{tilde over (W)} _(m) =[{tilde over (w)} _(m,1) . . . {tilde over (w)}_(m,R)0 . . . 0]  (10)

A feedback receiver 510 of each C-BTS 500 decodes received{SVI_(m,n)}_(n=1, . . . , R), and restores a gain matrix {tilde over(D)}_(m) of a diagonal matrix pattern as illustrated in a followingEquation (11) using scalar values indicated in F_(scalar) by R indexes.This is achieved by the gain matrix restoring unit 513.:{tilde over (D)} _(m)=diag{{tilde over (d)} _(m,1) , . . . ,{tilde over(d)} _(m,R),0, . . . ,0}  (11)

A feedback receiver 510 of each C-BTS 500 decodes a received LTEM_(m),and restores an eigen matrix {tilde over (E)}_(m). This is achieved byan eigen matrix restoring unit 515.

When the AT 100 transmits channel state information as illustrate inFIG. 3, the feedback receiver 510 includes a gain weight matrixrestoring unit 517 and an eigen matrix restoring unit 515 as illustratedin FIG. 6B, which is operated as follows.

A feedback receiver 510 of each C-BTS 500 restores a matrix {tilde over(F)}_(m) achieved by quantizing a received F_(m). This is achieved by again weight matrix restoring unit 517.

Moreover, a feedback receiver 510 of each C-BTS 500 decodes a receivedLTEM_(m) to restore an eigen matrix {tilde over (E)}_(m). This isachieved by an eigen matrix restoring unit 515. An inter-cell channelmatrix restoring unit 520 of each C-BTS 500 combines {tilde over(W)}_(m), {tilde over (D)}_(m), and {tilde over (E)}_(m) restored by thefeedback receiver 510 or restored {tilde over (E)}_(m) and {tilde over(F)}_(m) restored by the feedback receiver 510. Subsequently, a channelmatrix restoring unit 520 of each C-BTS 500 restores a quantizedinter-cell channel matrix as illustrated in a following Equation (12).:{tilde over (H)} _(m) ={tilde over (W)} _(m) {tilde over (D)} _(m){tilde over (E)} _(m) ^(H){tilde over (H)}={tilde over (F)} _(m) {tilde over (E)} _(m) ^(H)  (12)

An inter-cell channel coefficient restoring unit 610 decodes a receivedICVI, and restores {X_(m)}_(m=1, . . . , M) being an inter-cell channelcoefficient by referring a vector indicated in a vector code bookF_(inter) by an index.

The network channel matrix restoring unit 620 constructs quantizedchannel matrixes {{tilde over (H)}_(m)}_(m−1, . . . , M) and a restoredinter-cell channel coefficient {X_(m)}_(m=1, . . . , M) as illustratedin a following Equation (13) to restore a MIMO network channel.:{tilde over (H)} _(network)=[χ₁ {tilde over (H)} ₁ . . . χ_(M) {tildeover (H)} _(M)]  (13)

Here, quantized channel matrixes {{tilde over (H)}_(m)}_(m=1, . . . , M)are restored by C-BTSs 500 and transferred to a network channel matrixrestoring unit 620 through backhaul. Further, the network channel matrixrestoring unit 620 receives a restored inter-cell channel coefficient{X_(m)}_(m=1, . . . , M) from the inter-cell channel coefficientrestoring unit 610.

The scheduling and pre-coder determinator 630 schedules using restoredMIMO network channel information according to each AT 500. Further, thescheduling and pre-coder determinator 630 determines a pre-coding matrixaccording to scheduling, and calculates and determines a transmissionpossible capacity.

FIG. 7 is a flowchart illustrating a method for receiving channel stateinformation of a network according to an embodiment of the presentinvention.

Referring to FIG. 7, a feedback receiver of each C-BTS 500 restores amatrix {tilde over (F)}_(m) obtained by quantizing a received F_(m) inStep 710. This is achieved by a gain weight matrix restoring unit 517.

Next, a feedback receiver 510 of each C-BTS 500 decodes a receivedLTEM_(m) to restored an eigen matrix {tilde over (E)}_(m) in Step 720.This is achieved by an eigen matrix restoring unit 515.

Subsequently, a channel matrix restoring unit 520 of each C-BTS 500combines {tilde over (E)}_(m)

{tilde over (F)}_(m) restored by the feedback receiver 510 to restore aquantized channel matrix as illustrated in the Equation (12) in Step730.

After decoding a received ICVI, an inter-cell channel coefficientrestoring unit 610 restores an inter-cell channel coefficient{X_(m)}_(m=1, . . . , M) by referring a vector in a vector code bookF_(inter) indicated by the index in Step 740.

A network channel matrix restoring unit 620 restores a MIMO networkchannel in Step 750. The MIMO network channel may be restored by acombination of quantized channel matrixes {{tilde over(H)}_(m)}_(m=1, . . . , M) and a restored inter-cell channel coefficient{X_(m)}_(m=1, . . . , M) illustrated in the Equation (13).

The quantized channel matrixes {{tilde over (H)}_(m)}_(m=1, . . . , M)are restored by C-BTSs 500, and the network channel matrix restoringunit 620 receives them by backhaul. The network channel matrix restoringunit 620 receives the inter-cell channel coefficient{X_(m)}_(m=1, . . . , M) from the inter-cell channel coefficientrestoring unit 610.

A scheduling and pre-coder determinator 630 schedules using MIMO networkchannel information restored by ATs 100 in Step 760. Next, thescheduling and pre-coder determinator 630 determines a pre-coding matrixaccording to the scheduling, and calculates and determines atransmission possible capacity in Step 770.

FIG. 8 is a flowchart illustrating a method for receiving channel stateinformation of a network according to an embodiment of the presentinvention.

Referring to FIG. 8, after decoding a received{OVI_(M,n)}_(n=1, . . . , R), a feedback receiver 510 of each C-BTSrestores an output matrix {tilde over (W)}_(m) using vectors inF_(intra) indicated by R vector indexes as illustrated in the Equation(10) in Step 810. This is achieved by an output matrix restoring unit511.

A feedback receiver 510 of each C-BTS 500 decodes a received{SVI_(m,n)}_(n=1, . . . , R), and restores a gain matrix of a diagonalmatrix pattern {tilde over (D)}_(m) using scalar values in F_(scala)indicated by R indexes as illustrated in the Equation (11) in Step 820.This is achieved by a gain matrix restoring unit 513.

A feedback receiver 510 decodes a received LTEM_(m) by C-BTSs 500 torestore an eigen matrix {tilde over (E)}_(m) in Step 830. This isachieved by an eigen matrix restoring unit 515.

A channel matrix restoring unit 520 of each C-BTS 500 combines {tildeover (W)}_(m), {tilde over (D)}_(m), and {tilde over (E)}_(m) restoredby the feedback receiver 510 to restore a quantized channel matrix asillustrated in the Equation (12) in Step 840.

The inter-cell channel coefficient restoring unit 610 decodes a receivedICVI, and restores an inter-cell channel coefficient{X_(m)}_(m=1, . . . , M) by referring a vector in a vector code bookF_(inter) indicated by an index in Step 850.

A network channel matrix restoring unit 620 constructs quantized channelmatrixes {{tilde over (H)}_(m)}_(m=1, . . . , M) and a restoredinter-cell channel coefficient {X_(m)}_(m=1, . . . , M) as illustratedin the Equation (13) to restore a MIMO network channel in Step 860.

The quantized channel matrixes {{tilde over (H)}_(m)}_(m=1, . . . , M)are restored by C-BTSs 500, and a network channel matrix restoring unit620 receives them through backhaul. The network channel matrix restoringunit 620 receives the inter-cell channel coefficient{X_(m)}_(m=1, . . . , M) from the inter-cell channel coefficientrestoring unit 610.

A scheduling and pre-coder determinator 630 schedules using MIMO networkchannel information restored by ATs 100 in Step 870. Next, thescheduling and pre-coder determinator 630 determines a pre-coding matrixaccording to scheduling, and calculates and determines a transmissionpossible capacity in Step 880.

The present invention provides hybrid feedback technology forefficiently combining limited amounts of long-term feedback informationand short-term feedback information to transmit complete CSI to atransmitter in a MIMO network antenna system. To analyze the performanceof the provided hybrid feedback technology, the performance a directquantization based feedback scheme transferring complete CSI and theperformance of a Singular Value Decomposition (SVD) quantization basedfeedback scheme are compared and analyzed based on a capacity of aSpatial Multiplexing (SM) system. It is assume that the number n_(T) oftransmission antennas in a considered SM system is four, an antennainterval is 0.5λ, the number n_(R) of reception antennas is two, andthere is no space correlation between reception antennas. The followingis an SM system using hybrid feedback technology implemented onsimulation. The AT 100 estimates an inter-cell down link channel H_(m)from a BTS 500, and feedbacks quantized feedbacks complete CSI {tildeover (H)}_(m) to a BTS using the provided hybrid feedback technology. Itis assume that long-term feedback information E_(m) is transferred to aBTS without a quantization error or a transmission error. R diagonalcomponents {d_(m,n)}_(n=1, . . . , r) of a gain matrix D_(m) arequantized to 5 bits, and r 2×1 column vectors of an output matrix W_(m)are vector-quantized using a 3 bit 2×1 vector coder book of IEEE802.16e.

A transmitter SVDs feedback complete CSI {tilde over (H)}_(m) tocalculate a right singular matrix {tilde over (V)}_(m) and a diagonalmatrix {tilde over (Λ)}_(m) composed of diagonal components or singularvalues. An optimal power allocation matrix {tilde over (P)}_(m) isdetermined by a water-filling algorithm based on an average received SNRρ and obtained singular values, and pre-codes a real channel matrixH_(m) using pre-coding matrix {tilde over (F)}_(m)={tilde over(V)}_(m){tilde over (P)}_(m) to transmit data. At this time, a channelcapacity of a pre-coded channel matrix H_(m){tilde over (F)}_(m) isexpressed by a following Equation (14).:C(H _(m) {tilde over (F)} _(m),ρ)=log₂det(I _(n) _(R) +ρH _(m) {tildeover (F)} _(m) {tilde over (F)} _(m) ^(H) H _(m) ^(H))  (14)

An operation of an SM system using direct quantization based feedbacktechnology and SVD quantization based feedback technology is the same asthat of an SM system using hybrid feedback technology. However, there isa difference in quantization and feedback technologies used uponfeedback quantized complete CSI {tilde over (H)}_(m) to a base station.The direct quantization based feedback technology quantizes a norm ofn_(T) n_(R)×1 column vectors, namely, {∥h_(m,n)∥}_(n=1, . . . n) _(T)constituting an inter-cell down link channel matrix H_(m) to 5 bits, andn_(T) quantized n_(R)×1 column vectors{h_(m,n)/}∥h_(m,n)∥}_(n=1, . . . , n) _(T) are vector-quantized using 3bit 2×1 code book of IEEE 802.16e. The SVD quantization based feedbacktechnology SVDs an inter-cell down link channel matrix H_(m) toH_(m)=U_(m)L_(m)V_(m) ^(H) to, and quantizes U_(m) and V_(m) using a 3bit 2×2 unitary matrix code book and a 3 bit 4×4 unitary matrix codebook of IEEE 802.16e. Further, the SVD quantization based feedbacktechnology quantizes min(n_(R),n_(T)) singular values constituting Λ_(m)to 5 bits.

FIG. 9 is a graph comparing transmission capacities of an SM systemaccording to complete CSI feedback technology.

A graph of FIG. 9 is channel CSI feedback technology, which indicates anideal method transmitting a channel matrix of a non-quantized completedown link channel, a direct quantization directly quantizing andtransmitting a channel matrix, an SVD quantization SVD quantizing achannel matrix, and a hybrid FB according to an embodiment of thepresent invention.

The ideal method indicates an upper bound capacity as a transmissioncapacity of an SM achievable using non-quantized complete down linkchannel information H_(m). The direct quantization uses an instantaneousfeedback information amount of 32 bits/frame, the SVD quantization usesan instantaneous feedback information amount of 16 bits/frame, and theprovided hybrid feedback technology uses an instantaneous feedbackinformation amount less than 16 bits/frame.

As illustrated, the provided hybrid feedback technology provides amaximum SM capacity using the lowest feedback information amount invarious space correlation environment. Specifically, the provided hybridfeedback technology provides a capacity of upper bound in an AngularSpread at Transmitter (AST) range of a general mobile communicationenvironment, namely, AST≦15°. It can be appreciated that hybrid feedbacktechnology provided through this transmits complete CSI to a transmitterusing minimum short-term feedback information in a general mobilecommunication environment.

As illustrated previously, the present invention provides hybridfeedback technology that efficiently combines limited amounts oflong-term feedback information and short-term feedback information totransmit complete CSI to a MIMO network transmitter.

The hybrid feedback technology provided by the present invention dividesand quantizes a down link MIMO channel matrix into a long-term eigenmatrix which does not instantaneously change, a short-term gain matrixwhich instantaneously changes, and an output matrix to transfer completeCSI to a transmitter using minimum short-term feedback information.

As described earlier, layered feedback technology for a MIMO networksystem according to the present invention may feedback complete CSIregarding an inter-cell down link channel matrix feedback by C-BTSs 500and inter-cell channel coefficient information compensating a channeldifference between C-BTSs 500 to simultaneously use singular cell MIMOtechnology and MIMO network technology.

As illustrated previously, feedback technology of complete CSI for adown link MIMO network channel matrix according to the present inventionenables a pre-coder 600 to calculate various MIMO technologycombinations and a receiving possible SINR of ATs 100 with respect to apre-coding matrix, and simultaneously optimize ATs 100 transmitting dataand MIMO technology combination and pre-coding matrix to be used bycorresponding ATs 100 based on it.

Although embodiments of the present invention have been described indetail hereinabove, it should be clearly understood that many variationsand modifications of the basic inventive concepts herein taught whichmay appear to those skilled in the present art will still fall withinthe spirit and scope of the present invention, as defined in theappended claims.

What is claimed is:
 1. A method for transmitting channel stateinformation (CSI) by a terminal in a communication system supportingconnection between the terminal and a plurality of base stations, themethod comprising: receiving a signal from a first serving base station;receiving a signal from a second serving base station; measuring achannel based on the signal received from the first serving basestation; measuring a channel based on the signal received from thesecond serving base station; computing a CSI for the first serving basestation; computing a CSI for the second serving base station;transmitting the computed CSI for the first serving base station on achannel for the first serving base station; and transmitting thecomputed CSI for the second serving base station on a channel for thesecond serving base station.
 2. The method of claim 1, wherein each ofthe computed CSI for the first serving base station and the computed CSIfor the second serving base station comprises a first type informationand a second type information.
 3. The method of claim 2, wherein thefirst type information is long-term information and the second typeinformation is short-term information.
 4. The method of claim 2, whereinthe first type information includes an eigen matrix obtained byaccumulating covariance of a channel matrix indicating the measuredchannel and the second type information includes a value obtained bymultiplying the channel matrix by Hermitain of the eigen matrix.
 5. Themethod of claim 2, wherein the first type information does notinstantaneously change in every frame and the second type informationinstantaneously changes in every frame.
 6. A method for receivingchannel state information (CSI) by a first serving base station in acommunication system supporting connection between a terminal and aplurality of base stations, the method comprising: transmitting a signalto the terminal; and receiving a CSI for the first serving base stationbased on the signal, from the terminal, on a channel for the firstserving base station, wherein the CSI for the first serving base stationis computed, by the terminal, based on the signal transmitted from thefirst serving base station connected to the terminal, and wherein a CSIfor a second serving base station is computed, by the terminal, based ona signal transmitted from the second serving base station connected tothe terminal, and the CSI for the second serving base station istransmitted on a channel for the second serving base station.
 7. Themethod of claim 6, wherein each of the CSI for the first serving basestation and the CSI for the second serving base station comprises afirst type information and a second type information.
 8. The method ofclaim 7, wherein the first type information is long-term information andthe second type information is short-term information.
 9. The method ofclaim 7, wherein the first type information includes an eigen matrixobtained by accumulating covariance of a channel matrix indicating themeasured channel and the second type information includes a valueobtained by multiplying the channel matrix by Hermitain of the eigenmatrix.
 10. The apparatus of claim 7, wherein the first type informationdoes not instantaneously change in every frame and the second typeinformation instantaneously changes in every frame.
 11. A terminal fortransmitting channel state information (CSI) in a communication systemsupporting connection between the terminal and a plurality of basestations, the terminal comprising: a transceiver configured to transmitand receive signals to and from a first serving base station and asecond serving base station; and a controller configured to: receive asignal from the first serving base station, receive a signal from thesecond serving base station, measure a channel based on the signalreceived from the first serving base station, measure a channel based onthe signal received from the serving second base station, compute a CSIfor the first serving base station, compute a CSI for the second servingbase station, transmit the computed CSI for the first serving basestation on a channel for the first serving base station, and transmitthe computed CSI for the second serving base station on a channel forthe second serving base station.
 12. The apparatus of claim 11, whereineach of the computed CSI for the first base station and the computed CSIfor the second base station comprises a first type information and asecond type information.
 13. The terminal of claim 12, wherein the firsttype information is long-term information and the second typeinformation is short-term information.
 14. The terminal of claim 12,wherein the first type information includes an eigen matrix obtained byaccumulating covariance of a channel matrix indicating the measuredchannel and second type information includes a value obtained bymultiplying the channel matrix by Hermitain of the eigen matrix.
 15. Theterminal of claim 12, wherein the first type information does notinstantaneously change in every frame and the second type informationinstantaneously changes in every frame.
 16. A first serving base stationfor receiving channel state information (CSI) in a communication systemsupporting connection between a terminal and a plurality of basestations, the first serving base station comprising: a transceiverconfigured to transmit and receive signals to and from the terminal; anda controller configured to: transmit a signal, and receive a CSI for thefirst serving base station based on the signal, from the terminal, on achannel for the first serving base station, wherein the CSI for thefirst serving base station is computed, by the terminal, based on thesignal transmitted from the first serving base station connected to theterminal, and wherein a CSI for a second serving base station iscomputed, by the terminal, based on a signal transmitted from the secondserving base station connected to the terminal, and the CSI for thesecond serving base station is transmitted on a channel for the secondserving base station.
 17. The base station of claim 16, wherein each ofthe CSI for the first serving base station and the CSI for the secondserving base station comprises a first type information and a secondtype information.
 18. The base station of claim 17, wherein the firsttype information is long-term information and the second typeinformation is short-term information.
 19. The base station of claim 17,wherein the first type information includes an eigen matrix obtained byaccumulating covariance of a channel matrix indicating the measuredchannel and second type information includes a value obtained bymultiplying the channel matrix by Hermitain of the eigen matrix.
 20. Thebase station of claim 17, wherein the first type information does notinstantaneously change in every frame and the second type informationinstantaneously changes in every frame.